AlgorithmsNESETRIL, Jaroslav.Theoretical computer science. 2002, Vol 287, Num 2, issn 0304-3975, 266 p.Conference Proceedings

Algorithms (Prague, 16-18 July 1999)Nesetril, Jaroslav.Lecture notes in computer science. 1999, issn 0302-9743, isbn 3-540-66251-0, XII, 552 p, isbn 3-540-66251-0Conference Proceedings

A probabilistic approach to the dichotomy problemLUCZAK, Tomasz; NESETRIL, Jaroslav.SIAM journal on computing (Print). 2007, Vol 36, Num 3, pp 835-843, issn 0097-5397, 9 p.Article

Random lattices, threshold phenomena and efficient reduction algorithmsAKHAVI, Ali.Theoretical computer science. 2002, Vol 287, Num 2, pp 359-385, issn 0304-3975, 27 p.Conference Paper

Short answers to exponentially long questions : Extremal aspects of homomorphism dualityNESETRIL, Jaroslav; TARDIF, Claude.SIAM journal on discrete mathematics (Print). 2006, Vol 19, Num 4, pp 914-920, issn 0895-4801, 7 p.Article

Graph coloringsNESETRIL, Jaroslav; WOEGINGER, Gerhard.Theoretical computer science. 2005, Vol 349, Num 1, issn 0304-3975, 122 p.Conference Proceedings

Partitions of graphs into cographsGIMBEL, John; NESETRIL, Jaroslav.Discrete mathematics. 2010, Vol 310, Num 24, pp 3437-3445, issn 0012-365X, 9 p.Article

SMALL DIAMETERS OF DUALSNESETRIL, Jaroslav; SVEJDAROVA, Ida.SIAM journal on discrete mathematics (Print). 2008, Vol 21, Num 2, pp 374-384, issn 0895-4801, 11 p.Article

EuroComb '03 - Graphs and algorithmsNESETRIL, Jaroslav; BALEK, Martin.Discrete mathematics. 2007, Vol 307, Num 16, issn 0012-365X, 186 p.Serial Issue

Fast and robust smallest enclosing ballsGÄRTNER, B.Lecture notes in computer science. 1999, pp 325-338, issn 0302-9743, isbn 3-540-66251-0Conference Paper

Efficient algorithms for on-line symbol ranking compression (extended abstract)MANZINI, G.Lecture notes in computer science. 1999, pp 277-288, issn 0302-9743, isbn 3-540-66251-0Conference Paper

Improving mergesort for linked listsROURA, S.Lecture notes in computer science. 1999, pp 267-276, issn 0302-9743, isbn 3-540-66251-0Conference Paper

Approximate protein folding in the HP side chain model on extended cubic lattices (extended abstract)HEUN, V.Lecture notes in computer science. 1999, pp 212-223, issn 0302-9743, isbn 3-540-66251-0Conference Paper

Convex quadratic programming relaxations for network scheduling problemsSKUTELLA, M.Lecture notes in computer science. 1999, pp 127-138, issn 0302-9743, isbn 3-540-66251-0Conference Paper

On finding the maximum number of disjoint cuts in Seymour graphsAGEEV, A. A.Lecture notes in computer science. 1999, pp 490-497, issn 0302-9743, isbn 3-540-66251-0Conference Paper

Random Cayley graphs with O(log|G|) generators are expandersPAK, I.Lecture notes in computer science. 1999, pp 521-526, issn 0302-9743, isbn 3-540-66251-0Conference Paper

A note on random homomorphism from arbitrary graphs to ZLOEBL, Martin; NESETRIL, Jaroslav; REED, Bruce et al.Discrete mathematics. 2003, Vol 273, Num 1-3, pp 173-181, issn 0012-365X, 9 p.Conference Paper

Context-free pairs of groups II - Cuts, tree sets, and random walksWOESS, Wolfgang.Discrete mathematics. 2012, Vol 312, Num 1, pp 157-173, issn 0012-365X, 17 p.Article

Fulleroids with dihedral symmetryKARDOS, František.Discrete mathematics. 2010, Vol 310, Num 3, pp 652-661, issn 0012-365X, 10 p.Conference Paper

Tree-decompositions with bags of small diameterDOURISBOURE, Yon; GAVOILLE, Cyril.Discrete mathematics. 2007, Vol 307, Num 16, pp 2008-2029, issn 0012-365X, 22 p.Article

Spanning multi-paths in hypercubesCAHA, Rostislav; KOUBEK, Vaclav.Discrete mathematics. 2007, Vol 307, Num 16, pp 2053-2066, issn 0012-365X, 14 p.Article

L(p, q) labeling of d-dimensional gridsFERTIN, Guillaume; RASPAUD, André.Discrete mathematics. 2007, Vol 307, Num 16, pp 2132-2140, issn 0012-365X, 9 p.Article

Problems and results in extremal combinatorics. IALONG, Noga.Discrete mathematics. 2003, Vol 273, Num 1-3, pp 31-53, issn 0012-365X, 23 p.Conference Paper

On the orthogonal product of simplices and direct products of truncated Boolean latticesLECK, Uwe.Discrete mathematics. 2003, Vol 273, Num 1-3, pp 163-172, issn 0012-365X, 10 p.Conference Paper

State transfer on graphsGODSIL, Chris.Discrete mathematics. 2012, Vol 312, Num 1, pp 129-147, issn 0012-365X, 19 p.Article